ACL Wiki - User contributions [en]

Augmented Syntax Diagram

2012-12-05T18:37:02Z

Roxanne: /* External links */

'''Augmented Syntax Diagrams''' (abbreviated ASD) are a cross between [http://en.wikipedia.org/wiki/Augmented_transition_network Augmented Transition Networks] (ATNs) (Woods, 1970; Bates, 1978) and [http://en.wikipedia.org/wiki/Syntax_diagram Syntax Diagrams] (Goldberg & Robson, 1983; Jensen & Wirth, 1975). While ASD grammars are equally as powerful as ATNs, they are conceptually simpler. They involve fewer primitives, and they permit a grammar to be combined with the lexicon of a language, rather than being represented as a structure separate from the lexicon. They can represent any context-free grammar, and in addition they can be augmented like ATNs with arbitrary computational tests and actions which are to be performed as utterances are parsed.

The following are the main differences between ASD grammars and ATN grammars:

* ASD networks have node labels but no edge labels. In contrast, ATN networks require both node (state) labels and edge (arc) labels. The node labels of an ASD grammar correspond to the edge labels of an ATN.

* ASD networks are designed for bottom-up parsing; ATN networks are more suitable for top-down parsing.

* ASD networks have null or ''dummy'' nodes as the counterpart to JUMP arcs in ATN grammars. Both match empty strings in the utterance being parsed.

* ASD networks require only three kinds of node labels: (1) terminal vocabulary elements, (2) non-terminal vocabulary elements which represent phrase types, and (3) a special symbol, $$, to represent dummy nodes. Instance numbers in node labels distinguish between different nodes that are labeled with the same vocabulary element. In contrast, ATN networks require five kinds of arc labels: (1) PUSH arcs, (2) CAT arcs, (3) WORD arcs, (4) JUMP arcs, and (5) POP arcs, in addition to node labels.

* ASD networks can be represented in non-graphical form by a single lexicon containing both terminal and non-terminal vocabulary elements. In contrast, ATN networks require a representation for the grammar that is separate from the lexicon.

== See also ==
* [[Parsing]]

== External links ==
* [http://www.yorku.ca/jmason/asdindex.htm Augmented Syntax Diagram home page]
* [http://www.asdnetworks.com/ ASD demo site]

== References ==
* Bates, M., The theory and practice of augmented transition network grammars. In Natural Language Communication with Computers, L. Bolc, Ed., Springer-Verlag, 1978, pp. 191-259.
* Goldberg, A. and Robson, D., Smalltalk-80: The Language and its Implementation, Addison-Wesley, 1983.
* Jensen, K. and Wirth, N., Pascal User Manual and Report (2nd Edition), Springer-Verlag, 1975.
* Wikipedia, Syntax Diagram, http://en.wikipedia.org/wiki/Syntax_diagram .
* Woods, W.A., Transition network grammars for natural language analysis, Communications of the ACM 13:10 (Oct. 1970), pp. 591-606.

[[Category:Parsing]]

Dialogue Systems

2012-09-22T20:58:32Z

Roxanne: /* Projects */

'''Dialogue Systems''' are human-computer interfaces where interaction is modeled on natural language conversations between humans. Dialogue systems can be speech-based, text-based, or multimodal (e.g. speech plus graphics), and are used in simple applications (such as booking cinema tickets) as well as much more complex research systems (e.g. collaboration with robots, tutorial dialogue systems).

==History==

==Further reading==

There is a wikipedia article on [http://en.wikipedia.org/wiki/Dialogue_systems Dialogue Systems].

==Projects==

* '''CardWorld1''': A small example of dialog involving playing cards that uses direct manipulation as well as English is [http://www.yorku.ca/jmason/CardWorld1.html CardWorld1]. It involves ''deictic'' and ''anaphoric'' reference as well as direct reference to a changeable configuration of piles of cards on a virtual table top. The model can be extended in many directions, as suggested in the [http://www.yorku.ca/jmason/UnderstandingEnglishInLimitedPragmaticDomains.html documentation]. The implementation is in Java, and source code as well as executable code is open source. It can also be [http://www.asdnetworks.com/demos/cardworld2/ run directly] from a Java enabled web browser.

* '''TALK Project''': A recent EC project on dialogue systems is the [http://www.talk-project.org TALK project].

{{stub}}

[[Category:Research]]

Augmented Syntax Diagram

2012-07-18T16:12:35Z

Roxanne: /* External links */

'''Augmented Syntax Diagrams''' (abbreviated ASD) are a cross between [http://en.wikipedia.org/wiki/Augmented_transition_network Augmented Transition Networks] (ATNs) (Woods, 1970; Bates, 1978) and [http://en.wikipedia.org/wiki/Syntax_diagram Syntax Diagrams] (Goldberg & Robson, 1983; Jensen & Wirth, 1975). While ASD grammars are equally as powerful as ATNs, they are conceptually simpler. They involve fewer primitives, and they permit a grammar to be combined with the lexicon of a language, rather than being represented as a structure separate from the lexicon. They can represent any context-free grammar, and in addition they can be augmented like ATNs with arbitrary computational tests and actions which are to be performed as utterances are parsed.

The following are the main differences between ASD grammars and ATN grammars:

* ASD networks have node labels but no edge labels. In contrast, ATN networks require both node (state) labels and edge (arc) labels. The node labels of an ASD grammar correspond to the edge labels of an ATN.

* ASD networks are designed for bottom-up parsing; ATN networks are more suitable for top-down parsing.

* ASD networks have null or ''dummy'' nodes as the counterpart to JUMP arcs in ATN grammars. Both match empty strings in the utterance being parsed.

* ASD networks require only three kinds of node labels: (1) terminal vocabulary elements, (2) non-terminal vocabulary elements which represent phrase types, and (3) a special symbol, $$, to represent dummy nodes. Instance numbers in node labels distinguish between different nodes that are labeled with the same vocabulary element. In contrast, ATN networks require five kinds of arc labels: (1) PUSH arcs, (2) CAT arcs, (3) WORD arcs, (4) JUMP arcs, and (5) POP arcs, in addition to node labels.

* ASD networks can be represented in non-graphical form by a single lexicon containing both terminal and non-terminal vocabulary elements. In contrast, ATN networks require a representation for the grammar that is separate from the lexicon.

== See also ==
* [[Parsing]]

== External links ==
* [http://www.yorku.ca/jmason/asdindex.htm Augmented Syntax Diagram home page]
* [http://www.asdcardworld.com/ ASD demo site]

== References ==
* Bates, M., The theory and practice of augmented transition network grammars. In Natural Language Communication with Computers, L. Bolc, Ed., Springer-Verlag, 1978, pp. 191-259.
* Goldberg, A. and Robson, D., Smalltalk-80: The Language and its Implementation, Addison-Wesley, 1983.
* Jensen, K. and Wirth, N., Pascal User Manual and Report (2nd Edition), Springer-Verlag, 1975.
* Wikipedia, Syntax Diagram, http://en.wikipedia.org/wiki/Syntax_diagram .
* Woods, W.A., Transition network grammars for natural language analysis, Communications of the ACM 13:10 (Oct. 1970), pp. 591-606.

[[Category:Parsing]]

Augmented Syntax Diagram

2012-01-14T19:23:55Z

Roxanne: /* External links */

'''Augmented Syntax Diagrams''' (abbreviated ASD) are a cross between [http://en.wikipedia.org/wiki/Augmented_transition_network Augmented Transition Networks] (ATNs) (Woods, 1970; Bates, 1978) and [http://en.wikipedia.org/wiki/Syntax_diagram Syntax Diagrams] (Goldberg & Robson, 1983; Jensen & Wirth, 1975). While ASD grammars are equally as powerful as ATNs, they are conceptually simpler. They involve fewer primitives, and they permit a grammar to be combined with the lexicon of a language, rather than being represented as a structure separate from the lexicon. They can represent any context-free grammar, and in addition they can be augmented like ATNs with arbitrary computational tests and actions which are to be performed as utterances are parsed.

The following are the main differences between ASD grammars and ATN grammars:

* ASD networks have node labels but no edge labels. In contrast, ATN networks require both node (state) labels and edge (arc) labels. The node labels of an ASD grammar correspond to the edge labels of an ATN.

* ASD networks are designed for bottom-up parsing; ATN networks are more suitable for top-down parsing.

* ASD networks have null or ''dummy'' nodes as the counterpart to JUMP arcs in ATN grammars. Both match empty strings in the utterance being parsed.

* ASD networks require only three kinds of node labels: (1) terminal vocabulary elements, (2) non-terminal vocabulary elements which represent phrase types, and (3) a special symbol, $$, to represent dummy nodes. Instance numbers in node labels distinguish between different nodes that are labeled with the same vocabulary element. In contrast, ATN networks require five kinds of arc labels: (1) PUSH arcs, (2) CAT arcs, (3) WORD arcs, (4) JUMP arcs, and (5) POP arcs, in addition to node labels.

* ASD networks can be represented in non-graphical form by a single lexicon containing both terminal and non-terminal vocabulary elements. In contrast, ATN networks require a representation for the grammar that is separate from the lexicon.

== See also ==
* [[Parsing]]

== External links ==
* [http://www.yorku.ca/jmason/asdindex.htm Augmented Syntax Diagram home page]
* [http://www.asdgrammars.com/ ASD demo site]

== References ==
* Bates, M., The theory and practice of augmented transition network grammars. In Natural Language Communication with Computers, L. Bolc, Ed., Springer-Verlag, 1978, pp. 191-259.
* Goldberg, A. and Robson, D., Smalltalk-80: The Language and its Implementation, Addison-Wesley, 1983.
* Jensen, K. and Wirth, N., Pascal User Manual and Report (2nd Edition), Springer-Verlag, 1975.
* Wikipedia, Syntax Diagram, http://en.wikipedia.org/wiki/Syntax_diagram .
* Woods, W.A., Transition network grammars for natural language analysis, Communications of the ACM 13:10 (Oct. 1970), pp. 591-606.

[[Category:Parsing]]

Augmented Syntax Diagram

2012-01-14T19:23:03Z

Roxanne: /* External links */

'''Augmented Syntax Diagrams''' (abbreviated ASD) are a cross between [http://en.wikipedia.org/wiki/Augmented_transition_network Augmented Transition Networks] (ATNs) (Woods, 1970; Bates, 1978) and [http://en.wikipedia.org/wiki/Syntax_diagram Syntax Diagrams] (Goldberg & Robson, 1983; Jensen & Wirth, 1975). While ASD grammars are equally as powerful as ATNs, they are conceptually simpler. They involve fewer primitives, and they permit a grammar to be combined with the lexicon of a language, rather than being represented as a structure separate from the lexicon. They can represent any context-free grammar, and in addition they can be augmented like ATNs with arbitrary computational tests and actions which are to be performed as utterances are parsed.

The following are the main differences between ASD grammars and ATN grammars:

* ASD networks have node labels but no edge labels. In contrast, ATN networks require both node (state) labels and edge (arc) labels. The node labels of an ASD grammar correspond to the edge labels of an ATN.

* ASD networks are designed for bottom-up parsing; ATN networks are more suitable for top-down parsing.

* ASD networks have null or ''dummy'' nodes as the counterpart to JUMP arcs in ATN grammars. Both match empty strings in the utterance being parsed.

* ASD networks require only three kinds of node labels: (1) terminal vocabulary elements, (2) non-terminal vocabulary elements which represent phrase types, and (3) a special symbol, $$, to represent dummy nodes. Instance numbers in node labels distinguish between different nodes that are labeled with the same vocabulary element. In contrast, ATN networks require five kinds of arc labels: (1) PUSH arcs, (2) CAT arcs, (3) WORD arcs, (4) JUMP arcs, and (5) POP arcs, in addition to node labels.

* ASD networks can be represented in non-graphical form by a single lexicon containing both terminal and non-terminal vocabulary elements. In contrast, ATN networks require a representation for the grammar that is separate from the lexicon.

== See also ==
* [[Parsing]]

== External links ==
* [http://www.yorku.ca/jmason/asdindex.htm Augmented Syntax Diagram home page]
* [http://www.asdgrammars.com/ Augmented Syntax Diagram Demo Site]

== References ==
* Bates, M., The theory and practice of augmented transition network grammars. In Natural Language Communication with Computers, L. Bolc, Ed., Springer-Verlag, 1978, pp. 191-259.
* Goldberg, A. and Robson, D., Smalltalk-80: The Language and its Implementation, Addison-Wesley, 1983.
* Jensen, K. and Wirth, N., Pascal User Manual and Report (2nd Edition), Springer-Verlag, 1975.
* Wikipedia, Syntax Diagram, http://en.wikipedia.org/wiki/Syntax_diagram .
* Woods, W.A., Transition network grammars for natural language analysis, Communications of the ACM 13:10 (Oct. 1970), pp. 591-606.

[[Category:Parsing]]

Dialogue Systems

2011-10-12T19:24:40Z

Roxanne:

'''Dialogue Systems''' are human-computer interfaces where interaction is modeled on natural language conversations between humans. Dialogue systems can be speech-based, text-based, or multimodal (e.g. speech plus graphics), and are used in simple applications (such as booking cinema tickets) as well as much more complex research systems (e.g. collaboration with robots, tutorial dialogue systems).

==History==

==Further reading==

There is a wikipedia article on [http://en.wikipedia.org/wiki/Dialogue_systems Dialogue Systems].

==Projects==

* '''CardWorld1''': A small example of dialog involving playing cards that uses direct manipulation as well as English is [http://www.yorku.ca/jmason/CardWorld1.html CardWorld1]. It involves ''deictic'' and ''anaphoric'' reference as well as direct reference to a changeable configuration of piles of cards on a virtual table top. The model can be extended in many directions, as suggested in the [http://www.yorku.ca/jmason/UnderstandingEnglishInLimitedPragmaticDomains.html documentation]. The implementation is in Java, and source code as well as executable code is open source. It can also be [http://nlu.asd-networks.com/home/cardworld/cardworld1a/ run directly] from a Java enabled web browser.

* '''TALK Project''': A recent EC project on dialogue systems is the [http://www.talk-project.org TALK project].

{{stub}}

[[Category:Research]]

Dialogue Systems

2011-10-12T19:22:51Z

Roxanne:

'''Dialogue Systems''' are human-computer interfaces where interaction is modeled on natural language conversations between humans. Dialogue systems can be speech-based, text-based, or multimodal (e.g. speech plus graphics), and are used in simple applications (such as booking cinema tickets) as well as much more complex research systems (e.g. collaboration with robots, tutorial dialogue systems).

==History==

==Further reading==

There is a wikipedia article on [http://en.wikipedia.org/wiki/Dialogue_systems Dialogue Systems].

==Projects==

* '''CardWorld1''': A small example of dialog involving playing cards that uses direct manipulation as well as English is [http://www.yorku.ca/jmason/CardWorld1.html CardWorld1]. It involves ''deictic'' and ''anaphoric'' reference as well as direct reference to a changeable configuration of piles of cards on a virtual table top. The model can be extended in many directions, as suggested in the [http://www.yorku.ca/jmason/UnderstandingEnglishInLimitedPragmaticDomains.html documentation]. The implementation is in Java, and source code as well as executable code is available free. It can also be [http://nlu.asd-networks.com/home/cardworld/cardworld1a/ run directly] from a Java enabled web browser.

* '''TALK Project''': A recent EC project on dialogue systems is the [http://www.talk-project.org TALK project].

{{stub}}

[[Category:Research]]

Semantics software for English

2010-06-18T20:09:49Z

Roxanne:

'''[[Tools and Software]] - Semantics'''

For languages other than English, see [[List of resources by language]].


*[http://svn.ask.it.usyd.edu.au/trac/candc/wiki Boxer] - wide-coverage semantics based on DRT (Discourse Representation Theory)
*[http://www.yorku.ca/jmason/asdindex.htm/ CardWorld1] is an example of English-language understanding with non-trivial syntax, semantics and pragmatics.
*[http://sws.clearforest.com/blog ClearForest Semantic Web Service (API) ]
*[http://www.blackburnbos.org CURT] - Software from the Blackburn & Bos (2005) book: model checking, lambda calculus, underspecification, tableau inference, interfaces to theorem provers and model builders, and CURT itself.
*[http://www.intellexer.com/ Intellexer - Natural Language Searching Technologies]
*[http://www.ling.upenn.edu/lambda Lambda Calculator] - pedagogical software for lambda calculus and formal semantics in the style of the Heim & Kratzer (1998) textbook
*[http://nltk.org NLTK semantics] - Python libraries for lambda calculus, first order model checking, DRT, glue semantics, a tableau theorem prover and interfaces to external inference programs (Prover9, Mace4)
*[http://www.semantilog.org/pypes.html PyPES] - library for scoping, FOL translation, inferencing with the ERG (English Resource Grammar)
*[http://opencog.org/wiki/RelEx RelEx] - English-language semantic relationship extractor. Provides framing/grounding also, as well as tagging of various sorts. Open source, Java, Apache license.
*[http://senseclusters.sourceforge.net/ SenseClusters]
*[http://www.comp.lancs.ac.uk/ucrel/usas/ UCREL] - Semantic Analysis System
*[http://www.coli.uni-saarland.de/projects/chorus/utool/ utool] The Swiss Army Knife of Underspecification



[[Category:Semantics]]
[[Category:Software]]
[[Category:Resources for English]]

Semantics software for English

2010-06-17T23:46:59Z

Roxanne:

'''[[Tools and Software]] - Semantics'''

For languages other than English, see [[List of resources by language]].


*[http://svn.ask.it.usyd.edu.au/trac/candc/wiki Boxer] - wide-coverage semantics based on DRT (Discourse Representation Theory)
*[http://www.semantilog.org/pypes.html PyPES] - library for scoping, FOL translation, inferencing with the ERG (English Resource Grammar)
*[http://sws.clearforest.com/blog ClearForest Semantic Web Service (API) ]
*[http://www.blackburnbos.org CURT] - Software from the Blackburn & Bos (2005) book: model checking, lambda calculus, underspecification, tableau inference, interfaces to theorem provers and model builders, and CURT itself.
*[http://www.intellexer.com/ Intellexer - Natural Language Searching Technologies]
*[http://www.ling.upenn.edu/lambda Lambda Calculator] - pedagogical software for lambda calculus and formal semantics in the style of the Heim & Kratzer (1998) textbook
*[http://nltk.org NLTK semantics] - Python libraries for lambda calculus, first order model checking, DRT, glue semantics, a tableau theorem prover and interfaces to external inference programs (Prover9, Mace4)
*[http://opencog.org/wiki/RelEx RelEx] - English-language semantic relationship extractor. Provides framing/grounding also, as well as tagging of various sorts. Open source, Java, Apache license.
*[http://senseclusters.sourceforge.net/ SenseClusters]
*[http://www.comp.lancs.ac.uk/ucrel/usas/ UCREL] - Semantic Analysis System
*[http://www.coli.uni-saarland.de/projects/chorus/utool/ utool] The Swiss Army Knife of Underspecification
*[http://www.yorku.ca/jmason/asdindex.htm/ CardWorld1] is a simple example of English-language understanding with non-trivial syntax, semantics and pragmatics.
[[Category:Semantics]]
[[Category:Software]]
[[Category:Resources for English]]

Semantics software for English

2010-06-17T23:45:09Z

Roxanne:

'''[[Tools and Software]] - Semantics'''

For languages other than English, see [[List of resources by language]].


*[http://svn.ask.it.usyd.edu.au/trac/candc/wiki Boxer] - wide-coverage semantics based on DRT (Discourse Representation Theory)
*[http://www.semantilog.org/pypes.html PyPES] - library for scoping, FOL translation, inferencing with the ERG (English Resource Grammar)
*[http://sws.clearforest.com/blog ClearForest Semantic Web Service (API) ]
*[http://www.blackburnbos.org CURT] - Software from the Blackburn & Bos (2005) book: model checking, lambda calculus, underspecification, tableau inference, interfaces to theorem provers and model builders, and CURT itself.
*[http://www.intellexer.com/ Intellexer - Natural Language Searching Technologies]
*[http://www.ling.upenn.edu/lambda Lambda Calculator] - pedagogical software for lambda calculus and formal semantics in the style of the Heim & Kratzer (1998) textbook
*[http://nltk.org NLTK semantics] - Python libraries for lambda calculus, first order model checking, DRT, glue semantics, a tableau theorem prover and interfaces to external inference programs (Prover9, Mace4)
*[http://opencog.org/wiki/RelEx RelEx] - English-language semantic relationship extractor. Provides framing/grounding also, as well as tagging of various sorts. Open source, Java, Apache license.
*[http://senseclusters.sourceforge.net/ SenseClusters]
*[http://www.comp.lancs.ac.uk/ucrel/usas/ UCREL] - Semantic Analysis System
*[http://www.coli.uni-saarland.de/projects/chorus/utool/ utool] The Swiss Army Knife of Underspecification
*[http://www.yorku.ca/jmason/asdindex.htm] CardWorld1 is a simple example of English-language understanding with non-trivial syntax, semantics and pragmatics.
[[Category:Semantics]]
[[Category:Software]]
[[Category:Resources for English]]