612 search results - page 5 / 123 » A Computational Grammar for Georgian |
EMNLP
2010
14 years 7 months ago
2010
Unknown words are a hindrance to the performance of hand-crafted computational grammars of natural language. However, words with incomplete and incorrect lexical entries pose an e...
70
Voted
ACL
2009
14 years 7 months ago
2009
The development of Dialog-Based ComputerAssisted Language Learning (DB-CALL) systems requires research on the simulation of language learners. This paper presents a new method for...
139
Voted
BALT
2010
14 years 4 months ago
2010
For the purposes of tool development, computer languages are usually described using context-free grammars with annotations such as semantic actions or pretty-printing instructions...
84
Voted
COLING
2010
14 years 4 months ago
2010
Lexicalized Well-Founded Grammar (LWFG) is a recently developed syntacticsemantic grammar formalism for deep language understanding, which balances expressiveness with provable le...
134
click to vote
DCC
2011
IEEE
14 years 4 months ago
2011
IEEE
Larsson and Moffat’s RePair algorithm is generalized from strings to trees. The new algorithm (TreeRePair) produces straight-line linear context-free tree (SLT) grammars which a...