Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Online Resource
    Online Resource
    Cambridge :Cambridge University Press,
    UID:
    almahu_9947415157002882
    Format: 1 online resource (xii, 312 pages) : , digital, PDF file(s).
    ISBN: 9781139013574 (ebook)
    Content: Grammars of natural languages can be expressed as mathematical objects, similar to computer programs. Such a formal presentation of grammars facilitates mathematical reasoning with grammars (and the languages they denote), as well as computational implementation of grammar processors. This book presents one of the most commonly used grammatical formalisms, Unification Grammars, which underlies contemporary linguistic theories such as Lexical-Functional Grammar (LFG) and Head-driven Phrase Structure Grammar (HPSG). The book provides a robust and rigorous exposition of the formalism that is both mathematically well-founded and linguistically motivated. While the material is presented formally, and much of the text is mathematically oriented, a core chapter of the book addresses linguistic applications and the implementation of several linguistic insights in unification grammars. Dozens of examples and numerous exercises (many with solutions) illustrate key points. Graduate students and researchers in both computer science and linguistics will find this book a valuable resource.
    Note: Title from publisher's bibliographic system (viewed on 05 Oct 2015). , 1. Introduction; 2. Feature structures; 3. Unification; 4. Unification grammars; 5. Linguistic applications; 6. Computational aspects of unification grammars; 7. Conclusion; Appendixes.
    Additional Edition: Print version: ISBN 9781107014176
    Language: English
    URL: Volltext  (URL des Erstveröffentlichers)
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. Further information can be found on the KOBV privacy pages