Parsing Complex Sentences with Structured Connectionist Networks

@article{Jain1991ParsingCS,
  title={Parsing Complex Sentences with Structured Connectionist Networks},
  author={Ajay N. Jain},
  journal={Neural Computation},
  year={1991},
  volume={3},
  pages={110-120}
}
A modular, recurrent connectionist network is taught to incrementally parse complex sentences. From input presented one word at a time, the network learns to do semantic role assignment, noun phrase attachment, and clause structure recognition, for sentences with both active and passive constructions and center-embedded clauses. The network makes syntactic and semantic predictions at every step. Previous predictions are revised as expectations are confirmed or violated with the arrival of new… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Explore Further: Topics Discussed in This Paper

Citations

Publications citing this paper.
SHOWING 1-10 OF 29 CITATIONS

References

Publications referenced by this paper.
SHOWING 1-10 OF 14 REFERENCES

Encoding input / output representations in connectionist cognitive systems

  • D. E. Rumelhart, M. G. Dyer
  • Proceedings of the Connectionist Models Summer…
  • 1989

A connectionist context - free parser which is not context - free but then it is not really connectionist either

  • E. Charniak, E. Santos
  • Proc . Ninth Ann . Conf . Cog . Sci . Soc .
  • 1987

A connectionist context-free parser

  • E. Charniak, E. Santos
  • 1987

Similar Papers

Loading similar papers…