![[HaBo]](/styles/default/logoklein.png){kind=small}
Ich denke, die Aufgabe sollte mehr oder weniger klar sein. Welche Buchstaben welcher Taste ensprechen, kann man auch bei http://de.wikipedia.org/wiki/Text_on_9_keys anschauen.
#!/usr/bin/python
import sys
def word2num(word):
word = word.upper()
nums = ""
for id in range(len(word)):
code = ord(word[id]) - 65
if (code < 0 or code > 25):
continue
if code < 3: nums += '2'
elif code < 6: nums += '3'
elif code < 9: nums += '4'
elif code < 12: nums += '5'
elif code < 15: nums += '6'
elif code < 19: nums += '7'
elif code < 22: nums += '8'
else: nums += '9'
return nums
if len(sys.argv) < 3:
print "usage: %s <dictionary> <word>" % sys.argv[0]
sys.exit(1)
dictfile = sys.argv[1]
search = sys.argv[2]
lines = open(dictfile, 'r').readlines()
for line in lines:
asNum = word2num(line)
if asNum == search:
print line,
#!/usr/bin/perl
# T9 Demo App
my @wordlist = ("ich", "du", "er", "sie", "es", "wir", "ihr", "mich", "dich", "ihn", "ihr", "uns", "euch", "vor", "nach", "bei", "seit", "in", "im", "an", "am", "der", "die", "das", "hinter", "neben", "links", "rechts", "weg", "hier", "dort", "man", "sei", "doch", "nicht", "so", "hoch", "tief", "wie", "was", "wer", "wo", "wem", "warum", "wieso", "weshalb", "und", "los");
my @subst = (" ", "abc", "def", "ghi", "jkl", "mno", "pqrs", "tuv", "wxyz");
my $i = 1;
print "Bitte T9-Zahlenfolge eingeben:\n";
chomp(my $matcher = <STDIN>);
print "Infrage kommende Woerter:\n";
map { $matcher =~ s/$i/[$_]/g; $i++ } (@subst);
map { print "* $_\n" if /^$matcher$/ } (@wordlist);
. Ich eine andere Idee verwendet: am Anfang wählt man alle Wörter aus, dann reduziert man diese Menge bei jede folgende Taste, indem man alle Wörter entfernt, die an der Stelle i keinen entsprechenden Buchstaben haben. Am Ende bleiben nur die gültigen Wörter. Die Lösung wurde mit etwas Groovy und Regex einfacher als ich dachte:
// the word-list: it contains all known words
def words = ["machen", "gehenn", "ocagem", "mallen", "ocagar"]
// the user input: a sequence of button presses
def input = [6, 2, 2] // "machen", "ocagem", "ocagar"
// the mapping of buttons to characters: array-index=button, array-element=charset
// 0 1 2 3 4 5 6 7 8 9
def buttons = ["[ ]", "[.,?!]", "[abc]", "[def]", "[ghi]", "[jkl]", "[mno]", "[pqrs]", "[tuv]", "[wxyz]"]
// take the charsets that correspond to the input and build a regex and a pattern
def regex = input.collect { buttons[it] }.join() + ".*" // [mno][abc][abc][ghi][def][mno].*
def pattern = ~regex
// use the regex to match the words from the word-list
def result = words.grep(pattern)
println resultpublic class SmsMain {
/**
* @param args
*/
public static void main(String[] args) {
System.out.println(new T9().getWordsByKeys("4"));
System.out.println(new T9().getWordsByKeys("4 3"));
System.out.println(new T9().getWordsByKeys("7 7 6"));
}
}public class T9 {
private WordList wordList = null;
private ArrayList<String> keySet = null;
public T9() {
this.wordList = new WordList();
this.keySet = new ArrayList<String>();
this.init();
}
private void init() {
this.keySet.add("[ ]");
this.keySet.add("[.,?!]");
this.keySet.add("[abc]");
this.keySet.add("[def]");
this.keySet.add("[ghi]");
this.keySet.add("[jkl]");
this.keySet.add("[mno]");
this.keySet.add("[pqrs]");
this.keySet.add("[tuv]");
this.keySet.add("[wxyz]");
}
public String getWordsByKeys(String value) {
String regex = "";
for(int i=0; i<value.split(" ").length; i++)
regex += keySet.get(Integer.parseInt(value.split(" ")[i])) + ".*";
return Arrays.toString(wordList.getWords(regex).toArray());
}
}public class WordList {
private ArrayList<String> words = null;
public WordList() {
this.words = new ArrayList<String>();
this.init();
}
private void init() {
this.words.add("ich");
this.words.add("programmiere");
this.words.add("ein");
this.words.add("paar");
this.words.add("aufgaben");
this.words.add("aus");
this.words.add("dem");
this.words.add("hackerboard");
this.words.add("nach");
}
public ArrayList<String> getWords(String regex) {
ArrayList<String> wordsMatch = new ArrayList<String>();
for(String word : words) {
if(word.matches(regex))
wordsMatch.add(word);
}
return wordsMatch;
}
}:-use_module(library(lists)).
:-dynamic dict/2.
key(Char,Key):-nth1(Num,[" ","abcABC","defDEF","ghiGHI","jklJKL","mnoMNO",
"pqrsPQRS","tuvTUV","wxyzWXYZ"],Seq), member(Char,Seq),!,
number_chars(Num,[Key]).
word2key(Word,Key):-maplist(key,Word,Key).
append_([X],[X|_]).
append_([H|T],[H|T2]):-append_(T,T2).
t9(Num):-number_chars(Num,Chars),append_(Chars,Key),
findall(_,(dict(Key,Word),(atom_codes(A,Word),write(A),nl)),_).
read_dict(File):-retractall(dict(_,_)),
open(File,read,Stream),
repeat,
read_line(Stream,Word), %SWI: read_line_to_codes(Stream,Line)
(word2key(Word,Key) -> assertz(dict(Key,Word))
; true),
Word=end_of_file,
close(Stream).?- read_dict('test.txt').
yes
| ?- t9(3).
du
er
es
dich
euch
der
die
das
dort
doch
?- t9(34).
dich
die
yes
| ?- t9(342).
dich
yes