341 search results - page 28 / 69 » Formal Grammars of Early Language |
PASTE
2010
ACM
15 years 1 months ago
2010
ACM
Packrat parsing is a powerful parsing algorithm presented by Ford in 2002. Packrat parsers can handle complicated grammars and recursive structures in lexical elements more easily...
125
click to vote
JOLLI
2006
14 years 11 months ago
2006
We examine the expressive power of probabilistic context free grammars (PCFGs), with a special focus on the use of probabilities as a mechanism for reducing ambiguity by filtering ...
FSMNLP
2005
Springer
15 years 4 months ago
2005
Springer
Abstract. We present a formalization of lexicalized Recursive Transition Networks which we call Automaton-Based Generative Dependency Grammar (gdg). We show how to extract a gdg fr...
ACL
2003
15 years 13 days ago
2003
We will demonstrate the latest version of an ongoing project to create an intelligent procedure assistant for use by astronauts on the International Space Station (ISS). The syste...
ICWE
2007
Springer
15 years 5 months ago
2007
Springer
Combining expressiveness and plainness in the design of web documents is a difficult task. Validation languages are very powerful and designers are tempted to over-design specific...