Formal grammar (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Formal grammar" in English language version.

refsWebsite

Global rank English rank

3web.archive.org

1^st place

2doi.org

2^nd place

1books.google.com

3^rd place

1semanticscholar.org

11^th place

8^th place

1typeset.io

low place

1upenn.edu

702^nd place

520^th place

1cmu.edu

1,564^th place

1,028^th place

1sciencedirect.com

149^th place

178^th place

1umbc.edu

low place

9,434^th place

1may.ie

low place

1newspapers.com

55^th place

36^th place

1bford.info

low place

1arxiv.org

69^th place

59^th place

1mit.edu

415^th place

327^th place

arxiv.org

Sleator, Daniel D. & Temperly, Davy, "Parsing English with a Link Grammar," Technical Report CMU-CS-91-196, Carnegie Mellon University Computer Science, 1991.

bford.info

Birman, Alexander, The TMG Recognition Schema, Doctoral thesis, Princeton University, Dept. of Electrical Engineering, February 1970.

books.google.com

Meduna, Alexander (2014), Formal Languages and Computation: Models and Their Applications, CRC Press, p. 233, ISBN 9781466513457. For more on this subject, see undecidable problem.

cmu.edu

ra.adm.cs.cmu.edu

Earley, Jay, "An Efficient Context-Free Parsing Algorithm Archived 2020-05-19 at the Wayback Machine," Communications of the ACM, Vol. 13 No. 2, pp. 94-102, February 1970.

doi.org

Chomsky, Noam (Sep 1956). "Three models for the description of language". IRE Transactions on Information Theory. 2 (3): 113–124. doi:10.1109/TIT.1956.1056813. S2CID 19519474.
Knuth, D. E. (July 1965). "On the translation of languages from left to right". Information and Control. 8 (6): 607–639. doi:10.1016/S0019-9958(65)90426-2.

may.ie

cs.may.ie

Notes on Formal Language Theory and Parsing Archived 2017-08-28 at the Wayback Machine, James Power, Department of Computer Science National University of Ireland, Maynooth Maynooth, Co. Kildare, Ireland.JPR02

mit.edu

dspace.mit.edu

Ford, Bryan, Packrat Parsing: a Practical Linear-Time Algorithm with Backtracking, Master’s thesis, Massachusetts Institute of Technology, Sept. 2002.

newspapers.com

Borenstein, Seth (April 27, 2006). "Songbirds grasp grammar, too". Northwest Herald. p. 2 – via Newspapers.com.

sciencedirect.com

Joshi, Aravind K., et al., "Tree Adjunct Grammars," Journal of Computer Systems Science, Vol. 10 No. 1, pp. 136-163, 1975.

semanticscholar.org

api.semanticscholar.org

Chomsky, Noam (Sep 1956). "Three models for the description of language". IRE Transactions on Information Theory. 2 (3): 113–124. doi:10.1109/TIT.1956.1056813. S2CID 19519474.

typeset.io

Ashaari, S.; Turaev, S.; Okhunov, A. (2016). "Structurally and Arithmetically Controlled Grammars" (PDF). International Journal on Perceptive and Cognitive Computing. 2 (2): 27. Retrieved 2024-11-05.

umbc.edu

csee.umbc.edu

Knuth, Donald E., "Semantics of Context-Free Languages," Mathematical Systems Theory, Vol. 2 No. 2, pp. 127-145, 1968.

upenn.edu

seas.upenn.edu

Sentential Forms Archived 2019-11-13 at the Wayback Machine, Context-Free Grammars, David Matuszek

web.archive.org

Sentential Forms Archived 2019-11-13 at the Wayback Machine, Context-Free Grammars, David Matuszek
Earley, Jay, "An Efficient Context-Free Parsing Algorithm Archived 2020-05-19 at the Wayback Machine," Communications of the ACM, Vol. 13 No. 2, pp. 94-102, February 1970.
Notes on Formal Language Theory and Parsing Archived 2017-08-28 at the Wayback Machine, James Power, Department of Computer Science National University of Ireland, Maynooth Maynooth, Co. Kildare, Ireland.JPR02