Editing A* search algorithm (section)

==Applications==
A* is often used for the common [[pathfinding]] problem in applications such as video games, but was originally designed as a general graph traversal algorithm.<ref name="nilsson"/>
It finds applications in diverse problems, including the problem of [[parsing]] using [[Stochastic context-free grammar|stochastic grammars]] in [[Natural language processing|NLP]].<ref>{{cite conference
|url= https://people.eecs.berkeley.edu/~klein/papers/pcfg-astar.pdf
|last1=Klein
|first1=Dan
|last2=Manning
|first2=Christopher D.
|title=A* parsing: fast exact Viterbi parse selection
|book-title=Proceedings of the 2003 Human Language Technology Conference of the North American Chapter of the Association for Computational Linguistics
|pages=119–126
|doi=10.3115/1073445.1073461
|year=2003
}}</ref>
Other cases include an Informational search with online learning.<ref name="WPCleanerAuto1">{{cite journal
 |url          = http://www.eng.tau.ac.il/~bengal/GTA.pdf
 |title        = A Group-Testing Algorithm with Online Informational Learning
 |author       = Kagan E.
 |author2      = Ben-Gal I.
 |journal      = IIE Transactions
 |volume       = 46
 |issue        = 2
 |pages        = 164–184
 |year         = 2014
 |doi          = 10.1080/0740817X.2013.803639
 |s2cid        = 18588494
 |access-date  = 2016-02-12
 |archive-date = 2016-11-05
 |archive-url  = https://web.archive.org/web/20161105103321/http://www.eng.tau.ac.il/~bengal/GTA.pdf
 |url-status   = dead
}}</ref>