
	Where results make sense

Topic: String searching

	Cprogramming.com - C++ Standard Library - String Class
		String concatenation will work as long as either of the two strings is a C++ string--the other can be a static string or a char*.
		Fortunately, for C++ strings, all of the typical relational operators work as expected to compare either C++ strings or a C++ string and either a C string or a static string (i.e., "one in quotes").
		String concatenation can be implemented in terms of insert, using the position past the last element of the string as the insertion point (i.e., the str.length()).
	www.cprogramming.com /tutorial/string.html (1274 words)

	Rabin-Karp string search algorithm - Open Encyclopedia (Site not responding. Last check: 2007-11-06)
		The Rabin-Karp algorithm is a string searching algorithm that seeks a pattern, i.e.
		For example, if we have text "abracadabra" and we are searching for a pattern of length 3, we can compute the hash of "bra" from the hash for "abr" (the previous substring) by subtracting the number added for the first 'a' of "abr", i.e.
		Rabin-Karp is inferior to Knuth-Morris-Pratt algorithm, Boyer-Moore string searching algorithm and other faster single pattern string searching algorithms because of its slow worst case behavior.
	open-encyclopedia.com /Rabin-Karp_string_search_algorithm (1464 words)

	Fuzzy string searching - Wikipedia, the free encyclopedia
		Fuzzy string searching is the name for a category of techniques for finding one or more substrings of a text that approximately match some given pattern string.
		The bitap algorithm is one fuzzy string searching algorithm that is efficient for relatively short pattern strings.
		The Unix utility agrep is a fuzzy string searching program.
	en.wikipedia.org /wiki/Fuzzy_string_searching (88 words)

	Java 2 Platform SE v1.3.1: Class String
		Strings are constant; their values cannot be changed after they are created.
		Two strings are considered equal ignoring case if they are of the same length, and corresponding characters in the two strings are equal ignoring case.
		If two strings are different, then either they have different characters at some index that is a valid index for both strings, or their lengths are different, or both.
	java.sun.com /j2se/1.3/docs/api/java/lang/String.html (4467 words)

	Frodo's Workshop - Boyer-Moore Algorithm (Site not responding. Last check: 2007-11-06)
		The simplest approach to string searching is the brute-force method, which involves comparing each and every substring in the text that's being searched against the text that's being searched for.
		Given a buffer M whose length is m and a search string N whose length is n, a brute force search through all of M for occurences of N requires at least m-n+1 individual comparisons.
		Where a brute force comparison left-aligns the strings to be compared and begins with the first character in each string, Boyer-Moore left-aligns the strings and compares the last character of the search string to the corresponding character in the string to be searched.
	userpages.aug.com /frodo/boyer.html (1125 words)

	Efficient text searching in Java: Finding the right string in any language
		However, a traditional, brute-force string search is quite possible using the JDK 1.1 API.
		String searching is a well-researched area, and there are algorithms that can do considerably better.
		To implement Boyer-Moore searching with JDK 1.2, we first need to construct a shift table that tells us how far to shift the pattern when a particular collation element is seen in the text.
	www-128.ibm.com /developerworks/java/library/j-text-searching.html (3709 words)

	CodeGuru Forums - search a string
		Searching in a small string is something else, but suppose if you have one huge string (say in MBs), then its better to come up with your own technique.
		Now, when you want to search a word, first you'll get the length, suppose if there isn't any such word exist (w.r.t length), then you'll immediately get the result as there will be no matching key for the map.
		That is, count the occurrence of each character that is in string a in string b.
	www.codeguru.com /forum/printthread.php?t=348506 (1203 words)

	String Searching
		Searching for a simple string in a text file is one of the classic problems in the history of computing.
		Each search has a scan loop, where we look for a place where the string might be found, and a match loop, where we look more closely to see if we have a complete match once the scan has picked up a potential match case.
		The basic idea to speed up the search is to make the scan loop as fast as possible (both by keeping it extremely simple and streamlined, and by being smart in how we use the scan information), and to try to keep away from using the match loop.
	www.grouse.com.au /ggrep/string.html (2351 words)

	String Searching by Block Sorting (Site not responding. Last check: 2007-11-06)
		The simplest algorithm for searching for one string (the "needle") in another larger string (the "haystack") looks like this:
		comparisons, but when the comparisons are between strings, the cost of each comparison is non-trivial as well.
		Search engines and indexing is a related area, and it seems not impossible there might be an application there.
	www.chiark.greenend.org.uk /~sgtatham/algorithms/blocksort.html (442 words)

	ICU Userguide
		String searching, also known as string matching, is a very important subject in the wider domain of text processing and analysis.
		The ICU string search service uses the Boyer-Moore searching algorithm based on automata or combinatorial properties of strings and pre-processes the pattern.
		Assuming that we are searching for the accent "¨" (\u00a8) in "X´¨¸" (X\u00b4\u00a8\u00b8) and that "X´¸" (X\u00b4\u00b8) is a contraction sequence, the string search service will provide a match result at offsets <0, 4> during a forward search but offsets <1,3> during a backward search.
	www.icu-project.org /userguide/searchString.html (1970 words)

	SparkNotes: Hash Tables: Another use of hashing: Rabin-Karp string searching
		For example, when you execute the "Find" command in your word processor, your program starts at the beginning of the string holding all the text (let's assume for the moment that this is how your word processor stores your text, which it probably doesn't) and searches within that text for another string you've specified.
		Compare the first n characters of the text string (where n is the length of the pattern string) to the pattern string.
		If they are, then we need to do a normal string comparison to check if they are actually the same string or if they just hashed to the same value (remember that two different strings can hash to the same value).
	www.sparknotes.com /cs/searching/hashtables/section4.rhtml (1111 words)

	2.3.6.1 String Methods (Site not responding. Last check: 2007-11-06)
		Return true if all cased characters in the string are lowercase and there is at least one cased character, false otherwise.
		Return true if the string is a titlecased string and there is at least one character, for example uppercase characters may only follow uncased characters and lowercase characters only cased ones.
		Return a titlecased version of the string: words start with uppercase characters, all remaining cased characters are lowercase.
	www.python.org /dev/doc/devel/lib/string-methods.html (747 words)

	Tools and Implements Catalogue : Search
		Visual Index searching involves scanning groups of schematic-style diagrams or drawings assembled on the basis of a shared characteristic such as title or function.
		In the meantime, one sample page is available, that which would be generated by a search of the form "title=plane".
		The maximum length of the search string is 80 characters.
	www-personal.umich.edu /~pfs/tool/search.html (283 words)

	JavaScript String Object
		fontsize(size) - String is displayed in the specified font from a value of 1 to 7.
		Searching begins at the index value in the string.
		substr(start, length) - Returns the string starting at the "start" index of the string Continuing for the specified length of characters unless the end of the string is found first.
	www.comptechdoc.org /independent/web/cgi/javamanual/javastring.html (418 words)

	Untitled
		So if a particular string contains characters 0 through N of the input text, the suffix pointer for that string will point to the node that is the termination point for the string starting at the root that represents characters 1 through N of the input text.
		One of the most frequent tasks performed when building the suffix tree is to search for the edge emanating from a particular node based on the first character in its sequence.
		The canonical representation of the suffix simply requires that the origin_node in the Suffix object be the closest parent to the end point of the string.
	www.dogma.net /markn/articles/suffixt/suffixt.htm (3378 words)

	The Rabin-Karp Algorithm
		This property can be used in a string searching algorithm as shown in algorithm 8.2.
		Figure 8.1: A hashing function to compute the hash of string, where the size of the character set is b and p is relatively prime to b.
		The trick that makes the Rabin-Karp string searching algorithm efficient is the fact that we have chosen a hash function which is easy to compute for adjacent substrings- once we know what the hash value of the first substring is, we can compute the hash value of the next in time O(1).
	www.eecs.harvard.edu /~ellard/Q-97/HTML/root/node43.html (1480 words)

	Searching a String (Microsoft Office XP Developer)
		The InStr function compares two strings, and if the second string is contained within the first, it returns the position at which the substring begins.
		To call the procedure, you pass in the string, the substring that you're looking for, and a constant indicating whether the search should be case-sensitive.
		The new starting position is the position at which the search text was found, plus the length of the search string.
	msdn.microsoft.com /library/en-us/modcore/html/deconsearchingstring.asp (789 words)

	Efficient text searching in Java: Finding the right string in any language
		However, a traditional, brute-force string search is quite possible using the JDK 1.1 API.
		String searching is a well-researched area, and there are algorithms that can do considerably better.
		To implement Boyer-Moore searching with JDK 1.2, we first need to construct a shift table that tells us how far to shift the pattern when a particular collation element is seen in the text.
	www.ibm.com /developerworks/java/library/j-text-searching.html (3709 words)

	The Old New Thing : The cost of trying too hard: String searching
		More advanced string searching algorithms can take advantage of characteristics of the target string, but in the general case, where the target string is of moderate size and is not pathological, all that the fancy search algorithms give you over the naive search algorithm is a somewhat smaller multiplicative constant.
		When WUA searches for updates, it actually uses a highly optimized protocol that only picks up new and changed updates, prunes out entire branches of updates based on OS and other applicability rules, omits languages that are not installed on the local machine, and then caches the results in a client-side database.
		In the vast majority of real-world cases, the time taken to blaze through the search string looking for all the occurences of the first letter in the target string is _far_ less than the time it takes to scan the string, build the index, blah blah blah.
	blogs.gotdotnet.com /oldnewthing/archive/2006/01/19/514834.aspx (2316 words)

	PHPBuilder.com - [Resolved] searching the string
		i need to search a string which are more than one time exits in string e.g.
		as in $pos find the string but it find first location not 2nd,3rd,4th here i need to find all location and also number of string found.
		the problum conunt the number of string is solved with substr_count.
	www.phpbuilder.com /board/showthread.php?threadid=10296987 (642 words)

	String library comparison (Site not responding. Last check: 2007-11-06)
		The comparison deals with: how the library stores the data in the string, how the library deals with IO on the strings (strings have to come from/goto places), how much of the problem of searching/comparing and parsing strings is dealt with for you, and how much testing the library does.
		Errors are dealt with by using another library to provide "exceptions" in C. Due to embedding the string with the in metadata, you need to pass pointers to your string pointer to all the allocating functions...
		Importantly there are no interfaces for removing data or substituting data in the string (you could probably do remove from the end of the string easily by playing with the pointers and counters, but you'd have to write your own function for it).
	www.and.org /vstr/comparison (5939 words)

	0.2.6 Boyer-Moore String Searching
		Using their method it is possible to search a data space for a known pattern without having to examine all the characters in the search space.
		Keep a pointer into the data space at the current search location; initialize this pointer to the start of the space plus n - 1 characters where n is the number of characters in the target string.
		If the character does occur in the target string, advance the pointer by n - p places where p is the position that the character in question first occurs in the target string.
	www.fearme.com /misc/alg/node25.html (293 words)

	A Fast String Scanning Algorithm with Small Startup Overhead
		While we are matching the last character of the pattern string, if we found an "impossible character" in the search string, we are safe to advance the search pointer by the length of the pattern string.
		After the last character of the pattern string matches with the source string character under the scan pointer, we scan the rest of the pattern string from left to right.
		In this example, the 5th character of the search string is 's', so it matches the last character of the pattern string.
	www.concentric.net /~Ttwang/tech/stringscan.htm (934 words)

	Debian -- libagrep-ocaml
		It was developed as part of a search engine for a largish MP3 collection; the "with error" searching comes handy for those who can't spell Liszt or Shostakovitch.
		Given a search pattern and a string, this algorithm determines whether the string contains a substring that matches the pattern up to a parameterizable number N of "errors".
		An "error" is either a substitution (replace a character of the string with another character), a deletion (remove a character) or an insertion (add a character to the string).
	packages.debian.org /testing/libs/libagrep-ocaml (243 words)

	Searching for a Character or a Substring within a String (Site not responding. Last check: 2007-11-06)
		searches backward from the end of the string.
		Returns the index of the first (last) occurrence of the specified string, searching forward (backward) from the specified index.
		is equal to the length of the string, which is one larger than the largest index into the string (because indices start at 0).
	java.sun.com /docs/books/tutorial/java/data/searchar.html (422 words)

	StringAlgorithms - PineWiki (Site not responding. Last check: 2007-11-06)
		These are some quick notes on algorithms for searching strings for particular substrings, patterns, repetitions, etc., and related topics like data compression.
		Instead, we'll talk about some DataStructures for representing large strings that allow many common tasks to be done very quickly once the original string has been preprocessed to produced the data structure (which can generally be done in linear time).
		The advantage of using a suffix trie is that searching for a string of length m takes O(m) time, since we can just walk down the trie at the rate of one node per character in m.
	pine.cs.yale.edu /pinewiki/StringAlgorithms (2109 words)

	PHPBuilder.com - [Resolved] Searching a string
		You might want to use explode() on the string instead, unless having 40 in the string should be treated as having 4 in the string.
		If the string is viewed as a string of characters, and we're looking for the character '4', then yes, $string contains the number 4.
		If the string is viewed as a comma separated list of integers, then no, $string does not contain the number 4.
	www.phpbuilder.com /board/showthread.php?s=&threadid=10299685 (171 words)

Try your search on: Qwika (all wikis)