Selected types of pg-ambiguity: Processing based on analysis by reduction

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1902, Issue , 2000, Pages 139-144

  Straňáková, Markéta ^a  

^a CHARLES UNIVERSITY   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

WORD ORDERS;

ARTIFICIAL INTELLIGENCE;

EID: 84947590426     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45323-7_24     Document Type: Conference Paper

References (6)

1. Allen, J.: Natural Language Understanding. The Benjamin/Cummings Publishing Company, 1987.
2. Holan, T., Kuboň, V., Oliva, K., Plátek, M.: On Complexity ofWord Order. Special Issue TAL on Dependency Grammars (to appear).
3. Marcus, S.: Sur la notion de projectivité. In: Zeitschr. für math. Logic und Grundlagen d. Math. XI, 1965, pp. 181–192.
4. Panevová, J.: K otázkám homonymie a neutralizace ve stavbě věty. Jazykovedné štúdie 16, 1981, pp. 85–89.
5. Sgall, P., Hajičová, E., Panevová, J.: The Meaning of the Sentence in Its Semantic and Pragmatic Aspects. Dordrecht:Reidel and Prague:Academia, 1986.
6. Straňáková, M.: Selected Types of Pg-Ambiguity. PBML 72, 1999, pp. 29–58.