Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Head-driven phrase structure grammar
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
==Implementations== Various [[parsing|parsers]] based on the HPSG formalism have been written and optimizations are currently being investigated. An example of a system analyzing [[German language|German]] [[Sentence (linguistics)|sentences]] is provided by the [[Freie Universität Berlin]].<ref>[http://hpsg.hu-berlin.de/~stefan/Babel/Interaktiv/ The Babel-System: HPSG Interactive<!-- Bot generated title -->]</ref> In addition the CoreGram<ref>[http://hpsg.hu-berlin.de/Projects/CoreGram.html The CoreGram Project]</ref> project of the Grammar Group of the [[Freie Universität Berlin]] provides open source grammars that were implemented in the TRALE system. Currently there are grammars for [[German language|German]],<ref>[http://hpsg.hu-berlin.de/Fragments/Berligram/ Berligram]</ref> [[Danish language|Danish]],<ref>[http://hpsg.hu-berlin.de/Fragments/Danish/ DanGram]</ref> [[Mandarin Chinese]],<ref>[http://hpsg.hu-berlin.de/Fragments/Chinese/ Chinese]</ref> [[Maltese language|Maltese]],<ref>[http://hpsg.hu-berlin.de/Fragments/Maltese/ Maltese]</ref> and [[Persian language|Persian]]<ref>[http://hpsg.hu-berlin.de/Fragments/Persian/ Persian]</ref> that share a common core and are publicly available. Large HPSG grammars of various languages are being developed in the Deep Linguistic Processing with HPSG Initiative ([[DELPH-IN]]).<ref>[http://www.delph-in.net/ DELPH-IN: Open-Source Deep Processing]</ref> Wide-coverage grammars of English,<ref>[https://archive.today/20120723212352/http://www.delph-in.net/erg/ English Resource Grammar and Lexicon<!-- Bot generated title -->]</ref> German,<ref>[https://web.archive.org/web/20061205202742/http://gg.dfki.de/ Berthold Crysmann<!-- Bot generated title -->]</ref> and [[Japanese language|Japanese]]<ref>[http://www.delph-in.net/jacy JacyTop - Deep Linguistic Processing with HPSG (DELPH-IN)<!-- Bot generated title -->]</ref> are available under an open-source license. These grammars can be used with a variety of inter-compatible open-source HPSG parsers: [[Linguistic Knowledge Builder|LKB]], PET,<ref>[http://heartofgold.dfki.de/PET.html DELPH-IN PET parser]</ref> Ace,<ref>[http://sweaglesw.org/linguistics/ace/ Ace: the Answer Constraint Engine]</ref> and ''agree''.<ref>[http://www.agree-grammar.com/ agree grammar engineering]</ref> All of these produce semantic representations in the format of “Minimal Recursion Semantics,” MRS.<ref>Copestake, A., Flickinger, D., Pollard, C., & Sag, I. A. (2005). [https://link.springer.com/article/10.1007/s11168-006-6327-9 Minimal recursion semantics: An introduction]. Research on Language and Computation, 3(2-3), 281-332.</ref> The declarative nature of the HPSG formalism means that these computational grammars can typically be used for both [[parsing]] and generation (producing surface strings from semantic inputs). Treebanks, also distributed by [[DELPH-IN]], are used to develop and test the grammars, as well as to train ranking models to decide on plausible interpretations when parsing (or realizations when generating). ''Enju'' is a freely available wide-coverage probabilistic HPSG parser for English developed by the Tsujii Laboratory at [[The University of Tokyo]] in [[Japan]].<ref>[http://www-tsujii.is.s.u-tokyo.ac.jp/enju/ Tsuji Lab: Enju parser home page] {{webarchive|url=https://web.archive.org/web/20100307175009/http://www-tsujii.is.s.u-tokyo.ac.jp/enju/ |date=2010-03-07 }} (retrieved Nov 24, 2009)</ref>
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)