The Lake Forest Park Municipal Code is current through Ordinance 1247, passed July 28, 2022.
Disclaimer: The city clerk’s office has the official version of the Lake Forest Park Municipal Code. Users should contact the city clerk’s office for ordinances passed subsequent to the ordinance cited above.
City Website: http://www.cityoflfp.com/
City Telephone: (206) 368-5440
Stemming extends a search to cover grammatical variations on a word. For example, a search for fish would also find fishing. A search for applied would also find applying, applies, and apply.
Fuzzy searching will find a word even if it is misspelled. For example, a fuzzy search for apple will find appple.
Select a fuzziness level from the drop-down menu to set how many characters off a word can be from your search term and still count as a hit.
Synonym searching looks for words that have the same meaning as the word you entered. For example, a synonym search for eleventh will also find 11th.
A Boolean search request consists of words or phrases linked by connectors such as and and or that indicate the relationship between them. Examples:
Both words must be present
Either word can be present
Apple must occur within 5 words of pear
Apple must not occur within 5 words of pear
Only apple must be present
If you use more than one connector, you should use parentheses to indicate precisely what you want to search for. For example,
apple and pear or orange juice could mean
(apple and pear) or orange, or it could mean
apple and (pear or orange).
Noise words, such as if and the, are ignored in searches.
Search terms may include the following special characters:
Matches any single character. Example: appl? matches apply or apple.
Matches any number of characters. Example: appl* matches application
Stemming. Example: apply~ matches apply, applies, applied.
Fuzzy search. Example: ba%nana matches banana, bananna.
Phonic search. Example: #smith matches smith, smythe.
Numeric range. Example: 12~~24 matches 18.
Variable term weighting. Example: apple:4 w/5 pear:1