341 search results - page 32 / 69 » Formal Grammars of Early Language |
IJCAI
1989
15 years 7 days ago
1989
Several theories of grammar currently converge toward inserting subcategorization information within lexical entries. Such a tendency would benefit from a parsing algorithm able t...
DLT
2010
15 years 15 days ago
2010
Abstract. Millstream systems have recently been proposed as a formalization of the linguistic idea that natural language should be described as a combination of different modules r...
103
click to vote
MFCS
2007
Springer
15 years 5 months ago
2007
Springer
In formal language theory, many families of languages are defined using grammars or finite acceptors like pushdown automata and Turing machines. For instance, context-sensitive l...
89
Voted
ACL
1998
15 years 13 days ago
1998
Much of the power of probabilistic methods in modelling language comes from their ability to compare several derivations for the same string in the language. An important starting...
ACL
2003
15 years 14 days ago
2003
We demonstrate that an unlexicalized PCFG can parse much more accurately than previously shown, by making use of simple, linguistically motivated state splits, which break down fa...