1242 search results - page 6 / 249 » The Theory of Grammar Constraints |
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...
ACL
1989
14 years 10 months ago
1989
A novel formalism is presented for Earley-like parsers. It accommodates the simulation of non-deterministic pushdown automata. In particular, the theory is applied to non-determin...
COLING
1994
14 years 10 months ago
1994
In this paper it is shown how simple texts that can be parsed in a Lambek Categorial Grammar can also automatically be provided with a semantics in the form of a Discourse Represe...
70
Voted
LATA
2010
Springer
15 years 4 months ago
2010
Springer
The smallest grammar problem - namely, finding a smallest context-free grammar that generates exactly one sequence - is of practical and theoretical importance in fields such as ...
78
Voted
ICTAI
2006
IEEE
15 years 3 months ago
2006
IEEE
Computer programs that can be expressed in two or more dimensions are typically called visual programs. The underlying theories of visual programming languages involve graph gramm...