String Symbol Position: Difference between revisions
Jump to navigation
Jump to search
m (Text replacement - "]] ** " to "]]. ** ") |
m (Text replacement - "]]s **" to "]]s. **") |
||
Line 21: | Line 21: | ||
** There are many [[algorithm]]s for processing strings, each with various trade-offs. Competing algorithms can be [[Analysis of algorithms|analyzed]] with respect to run time, storage requirements, and so forth. <P> Some categories of algorithms include: | ** There are many [[algorithm]]s for processing strings, each with various trade-offs. Competing algorithms can be [[Analysis of algorithms|analyzed]] with respect to run time, storage requirements, and so forth. <P> Some categories of algorithms include: | ||
*** [[String searching algorithm]]s for finding a given substring or pattern | *** [[String searching algorithm]]s for finding a given substring or pattern | ||
*** [[String manipulation algorithm]]s | *** [[String manipulation algorithm]]s. | ||
*** [[Sorting algorithm]]s | *** [[Sorting algorithm]]s. | ||
*** [[Regular expression]] algorithms | *** [[Regular expression]] algorithms | ||
*** [[Parser|Parsing]] a string | *** [[Parser|Parsing]] a string |
Latest revision as of 15:36, 24 July 2023
A String Symbol Position is a String Manipulation Function that can find the position of a String Symbol's within a string.
- AKA: String Position, String Character Position Function.
- Example(s):
- Counter-Example(s):
- See: String Member, Computer Character, Text Item, Position Function, Pattern Recognition Task, String Processing Algorithm.
References
2020a
- (Wikipedia, 2020) ⇒ https://en.wikipedia.org/wiki/String_(computer_science)#String_processing_algorithms Retrieved:2020-2-23.
- There are many algorithms for processing strings, each with various trade-offs. Competing algorithms can be analyzed with respect to run time, storage requirements, and so forth.
Some categories of algorithms include:
- String searching algorithms for finding a given substring or pattern
- String manipulation algorithms.
- Sorting algorithms.
- Regular expression algorithms
- Parsing a string
- Sequence mining.
- Advanced string algorithms often employ complex mechanisms and data structures, among the suffix trees and finite state machines.
The name stringology was coined in 1984 by computer scientist Zvi Galil for the issue of algorithms and data structures used for string processing.
- There are many algorithms for processing strings, each with various trade-offs. Competing algorithms can be analyzed with respect to run time, storage requirements, and so forth.
2020b
- (Stringr, 2020) ⇒ https://stringr.tidyverse.org/reference/str_locate.html Retrieved: 2020-02-23.